Various routing architectures for dynamic multi-hop backhauling cellular network and various methods useful in conjunction therewith

ABSTRACT

A hierarchical cellular network administration system operative to administrate for a hierarchical cellular network having a core, the hierarchical cellular network administration system comprising a link establishment initiator operative to generate link establishment commands; and relay manager functionality operative to establish at least one link between at least one relay in the hierarchical cellular network and all nodes in said cellular network desired to be served by said at least one relay, as per said link establishment commands generated by the link establishment initiator; and to control operation of links thus established.

REFERENCE TO CO-PENDING APPLICATIONS

This application claims priority from U.S. provisional application No.61/417,040, entitled “Various Routing Architectures for DynamicMulti-Hop Backhauling Cellular Network and Various Methods Useful inConjunction Therewith”, filed Nov. 24, 2010.

FIELD OF THE INVENTION

The present invention relates generally to communication systems andmore particularly to mobile communication systems.

BACKGROUND OF THE INVENTION

Many cellular communication networks are known, e.g. hierarchical mobilesystems as described in U.S. Pat. No. 5,657,317 to Mahany et al and U.S.Pat. No. 5,729,826 to Gavrilovich.

LTE and Wimax are known standards for mobile communication networks.

The disclosures of all publications and patent documents mentioned inthe specification, and of the publications and patent documents citedtherein directly or indirectly, are hereby incorporated by reference.

SUMMARY OF THE INVENTION

Certain embodiments shown and described herein are particularly usefulin conjunction with vehicle fleets in which vehicles, such as busses ortrains or taxis, are equipped with mobile base-stations which mayfunction as relays, and/or mobile telephones or other cellularcommunication devices.

For example, in rural areas where sole reliance on fixed cellularbase-station coverage limits the capacity of mobile stations at longranges, mobile base stations that are installed on transportable mobileplatforms e.g. busses, trains, taxis can enable high data-rateapplications such as web-browsing, video-streaming, and can also be usedas relays between other mobile base stations and fixed base stations. Inaddition, mobile base stations as described herein can be installedon-board airplanes to enable passengers to communicate with a fixedcellular infrastructure using their own cellular phones. Finally, if amass attended event is expected or has occurred, it may be desired tosend a fleet of mobile base-stations to the location of that event forthe duration of the event. For example, event organizers, e.g. culturalor sports event organizers, may own or hire such a fleet which may besent on one occasion to a first city in which a massively attendedpopular music concert or rally is being held, and on another occasion toa location in which Olympics or another mass-attended sports event isplanned.

Certain embodiments of the present invention seek to provide a dynamicself-learning centralistic network router for a multi-hop in-bandbackhauling network (centralistic approach), such as but not limited tobroadcast (of the data/traffic) to neighbors, when the destination isnot found, e.g. for voice calls or other applications; this has theadvantage of low latency but may suffer from the disadvantage of placinga high load on the network; or paging in which control messages only aretransmitted to neighbors, when the destination is not found, e.g. fordata traffic applications such as but not limited to emails, filetransfers, and browsing; this may suffer from the disadvantage of highlatency but places only a low load on the network.

Certain embodiments of the present invention seek to provide a dynamicself-learning distributed network router for a multi-hop in-bandbackhauling network, typically including a distributed routing table ateach hop.

Certain embodiments of the present invention seek to provide multi-hoprouting using broadcast messaging e.g. for the DL.

Certain embodiments of the present invention seek to provide a relaycomprising a plurality of BS transceivers, which typically facilitatesenlargement of the overall network capacity by adding more DL resourcesto the relay.

Certain embodiments of the present invention seek to provide a relaycomprising a plurality of MS transceivers, which typically facilitatesenlargement of the overall network capacity by adding more UL resourcesto the relay. Optionally, all MS are connected to the same serving“parent” which may for example be a base station or a relay.Alternatively, each MS transceiver is connected to a serving “parent”independent of the other MS transceivers. According to still a furtheralternative, MS transceivers are grouped into at least two groups, eachgroup being connected to a different serving “parent”.

Certain embodiments of the present invention seek to provide a relaycomprising a plurality of MS transceivers, and a plurality of BStransceivers.

Certain embodiments of the present invention seek to provide a RelayManager which supervises relays and may be placed in a suitable locationsuch as but not limited to the following LTE core architecturelocations: as an Application Server, As an Pre-Serving-Gateway entity,As a Post-eNB entity. The Relay Manager may interface the MME as virtualeNBs or as a virtual MME (Relay MME).

Certain embodiments of the present invention seek to provide operatingmethods, e.g, routing methods, useful in conjunction with hierarchicalnetworks such as but not limited to wireless hierarchical networks.

In a typical cellular telephone system, e.g. as depicted in prior artFIG. 1, an area is divided into cells where each cell has a serving BS.An SM moving in such a cellular network communicates by radio with thebest BS. The BSs communicate with the core network and with each otherby either using a direct cable, or by using point-to-point microwave.

Several procedures are common to all cellular telephone systems:

-   -   Handover is the procedure that runs when the SM moves between        cells while it is in service.    -   Cell selection is the procedure that selects the best BS to link        to.    -   A mobile ad-hoc network (MANET), e.g. as depicted in FIG. 2, is        a well studied concept in prior art. MANET is defined as an        autonomous system of mobile routes, their associated hosts being        connected by wireless links, the union of which forms an        arbitrary graph. Such networks have been introduced with little        degree of success, due to many technical and organizational        challenges among delays, power consumption and scalability.

A hierarchical mobile system, e.g. as depicted in FIG. 3, has tworadio-interface serving entities; BS and RA. The BSs are static basestations and the RAs are moving base stations comprising a radiointerface for a backhauling interface, and a base-station as a front endto the user. Due to dynamics in the hierarchical mobile system, it isdifficult to use a directional antenna; therefore there is a need to usean omni antenna. The user can connect to a BS or to a RA using the samestandard interface and is transparent to the kind that it is connectedto.

In FIG. 3, SMs are numbered 03, 06, 07, 11 and 12. The RAs are numbered02, 05 and 09. The BSs are numbered 01, 08 and 10. The core is numbered4. SM12 links to BS10, BS08 and RA09, its best link is to BS10 andtherefore it has an active link to the BS10 and connects to the corethrough BS10. SM11 links to RA09 BS08 and BS10, its best link is to BS08and therefore it has an active link to BS08. SM03 links to SB10, SB08and RA09 its best link is to RA09 and therefore it has active link toRA09. SM06 links to RA09, RA05, RA02 and BS01 its best link is to RA09and therefore it has active link to RA09. SM07 links to RA09, RA05, RA02and BS01 its best link is to RA05 and therefore it has active link toRA05.

RA02 links to RA09, BS01 its best link is to BS01 and therefore it hasactive link to BS01. RA09 links to RA02, BS01 and BS08 its best link isto BS08 and therefore it has active link to BS08. RA05 links to RA02,BS01 and BS08 its best link is to BS02 and therefore it has active linkto BS02.

Certain embodiments of the present invention seek to provideUplink/Downlink Multi-user in-band backhauling prioritization based onQOS criteria.

Certain embodiments of the present invention seek to provide loadbalancing in multi-hop relay architecture management based on networktopology.

Certain embodiments of the present invention seek to provide multi-hopencapsulation for uplink in-band backhauling, such encapsulationcomprising at least one bearer aggregating selected transmission. Theaggregation and selection depends on bearer type, user type, servicetype, etc.

Certain embodiments of the present invention seek to provide multi-hopdecapsulation for downlink in-band backhauling so as to decapsulate theabove mentioned encapsulation techniques.

Certain embodiments of the present invention seek to provide a dynamicbandwidth request for enlarging/reducing the uplink bandwidthallocation, based on suitable criteria such as but not limited to someor all of the following: number of served users, number of active/idleusers, type of served users (e.g. simple, chief, relay, others), type ofservice/application (e.g. voice, video, other), and QOS.

It is appreciated that depending on the application, data packets maystore at least one of: voice, video and data information.

The present invention typically includes at least the followingembodiments:

Embodiment 1

Relay apparatus including:

a relay manager operative to activate at least one link thereby to causesaid relay apparatus to function as a node in a hierarchical cellularnetwork; and

a first set of radio interfaces, having one or more radio interfaces,operative, when said relay apparatus is disposed at a level n of ahierarchical cellular network having a core, to provide:

a corresponding first set of uplinks, having one or more uplinks, fromsaid relay apparatus to at least one node disposed at least one level insaid network which is closer to the core than level n and

a corresponding set of downlinks, having one or more downlinks, fromsaid at least one node to said relay.

Embodiment 2

Relay apparatus including:

a relay manager operative to activate at least one link thereby to causethe relay apparatus to function as a node in a hierarchical cellularnetwork; and

a set of radio interfaces, having one or more radio interfaces,operative, when said relay apparatus is disposed at a level n of ahierarchical cellular network having a core, to provide:

a corresponding set of uplinks, having one or more uplinks, to saidrelay apparatus from at least one node disposed at least one level insaid network which is further from the core than level n; and

a corresponding set of downlinks, having one or more downlinks, fromsaid relay to said at least one node.

Embodiment 3

Relay apparatus according to embodiment 1 and also comprising a secondset of radio interfaces operative, when said relay is disposed at alevel n of a hierarchical cellular network having a core, to provide:

a corresponding second set of uplinks to said relay from at least onenode disposed at least one level in said network which is further fromthe core than level n; and

a corresponding second set of downlinks from said relay to said at leastone node.

Embodiment 4

A data relay manager providing method including:

providing a relay manager, operative to activate at least one linkthereby to cause a relay to function as a node in a hierarchicalcellular network, and a first set of radio interfaces operative, whensaid relay apparatus is disposed at a level n of a hierarchical cellularnetwork having a core, to provide:

a corresponding first set of uplinks from said relay apparatus to atleast one node disposed at least one level in said network which iscloser to the core than level n and

a corresponding first set of downlinks from said at least one node tosaid relay.

Embodiment 5

A method according to embodiment 4 wherein said sets of uplinks anddownlinks connect said relay to a single node disposed at a level insaid network which is closer to the core than level n.

Embodiment 6

A method according to embodiment 4 wherein said sets of uplinks anddownlinks connect said relay to a set of more than one nodes disposed atleast one level in said network which is closer to the core than leveln.

Embodiment 7

A method according to embodiment 6 wherein said set of uplinks anddownlinks connect said relay to a set of nodes corresponding in numberto said first set of radio interfaces and disposed at least one level insaid network which is closer to the core than level n.

Embodiment 8

A hierarchical cellular network administration system operative toadministrate for a hierarchical cellular network having a core, thehierarchical cellular network administration system comprising:

a link establishment initiator operative to generate link establishmentcommands; and

relay manager functionality operative:

to establish at least one link between at least one relay in thehierarchical cellular network and all nodes in said cellular networkdesired to be served by said at least one relay, as per said linkestablishment commands generated by the link establishment initiator;and to control operation of links thus established.

Embodiment 9

A system according to embodiment 8 wherein said link establishmentinitiator is incorporated within a server located in the core of thenetwork and wherein said server is also operative to interface thecore's mobility manager including causing said mobility manager toprovide said relay manager functionality.

Embodiment 10

A system according to embodiment 8 wherein said link establishmentinitiator and said relay manager functionality are incorporated within aserver located in the core of the network.

Embodiment 11

A system according to embodiment 9 or embodiment 10 and also comprisinga hierarchical/non-hierarchical information pre-processor,

wherein said network includes at least one non-hierarchical base stationwhich is operative to communicate with mobile communication devices andnot with relays and at least one hierarchical base station whichcommunicates with at least one relay and wherein said core includes amobility manager and a serving gateway communicating with said mobilitymanager and, via said hierarchical/non-hierarchical informationpre-processor, with at least one base,

said hierarchical/non-hierarchical information pre-processor beingoperative to receive information from at least one non-hierarchical basestation and from at least one hierarchical base station and to sendinformation received from hierarchical base stations, but notinformation from non-hierarchical base stations, to the relay managerfunctionality.

Embodiment 12

A mobile communication management system serving a hierarchical cellularnetwork having linked nodes, the nodes including a core, base stationsand mobile communication devices, thereby to define a topology ofcommunication links between said nodes, the system comprising:

-   -   a topology server including:

a topology learner which dynamically learns the topology and

a topology storing functionality which stores the topology learned bythe topology learner as at least one topology map structured as ahierarchy having more than 2 levels.

Embodiment 13

A system according to embodiment 12 wherein said topology server residesin a single node within said network.

Embodiment 14

A system according to embodiment 13 wherein said single node in whichsaid topology server resides in the core.

Embodiment 15

A system according to embodiment 12 wherein said topology-storingfunctionality stores the topology as a hierarchy tree whose number oflevels changes dynamically.

Embodiment 16

A system according to embodiment 12 wherein said server uses saidtopology map to dynamically route information through at least onedownlinks to arrive at a desired destination.

Embodiment 17

A system according to embodiment 16 wherein said server uses saidtopology map to dynamically route information by indicating, for each ofat least one levels, a sibling-node at said level via which node theinformation is to arrive at the desired destination within said map.

Embodiment 18

A system according to embodiment 17 wherein the server broadcasts datapackets intended for a destination node not found at a topologicallocation identified in said map by the server, to at least one basestation in the topology map, each of which broadcast to at least one oftheir “children” nodes in the hierarchal network.

Embodiment 19

A system according to embodiment 18 wherein the server broadcasts thedata packets intended for the not-found destination node to all basestations in a highest layer of the topology map, and each of said basestations broadcasts to all of their “children” nodes in the hierarchicalnetwork.

Embodiment 20

A system according to embodiment 19 wherein said not-found destinationnode sends an ‘ack’ to his father node in the hierarchy upon receptionof said data packets and said ‘ack’ is transmitted over an uplinkthrough the hierarchy to the topology server.

Embodiment 21

A system according to embodiment 19 wherein said data packets store atleast one of: voice, video and data information.

Embodiment 22

A system according to embodiment 18 wherein the topology map defines aset of nodes and wherein the server broadcasts data packets intended forthe not-found destination node only to a subset of said set of nodeswhich subset is characterized in that its nodes are adjacenttopologically, in said map, to the topological location identified bythe server as having belonged to the destination node.

Embodiment 23

A system according to embodiment 18 wherein the topology map defines aset of nodes and wherein the server broadcasts data packets intended forthe not-found destination node only to a subset of said set of nodeswhose subset is characterized in that its nodes are adjacentgeographically to the geographical location of the destination node.

Embodiment 24

A system according to embodiment 17 wherein the server broadcasts apaging message intended to locate a destination node not found at atopological location, identified within said map by the server, to atleast some base stations in the hierarchy, each of which broadcasts toat least one of their “children” nodes in the hierarchy.

Embodiment 25

A system according to embodiment 24 wherein the server broadcasts apaging message intended to locate the not-found destination node to allbase stations in a highest layer of the topology map, and each of saidbase stations broadcasts the paging message to all of their “children”nodes in the hierarchical network.

Embodiment 26

A system according to embodiments 24 or 25 wherein said not-founddestination node sends an ‘ack’, upon receipt of the paging message, toits father node in the hierarchy and said ‘ack’ is transmitted (uplink)through the hierarchy to the topology server.

Embodiment 27

A system according to embodiment 26 wherein only upon receipt of said‘ack’, data packets intended for said destination node which sent said‘ack’, are sent to said destination node.

Embodiment 28

A system according to embodiment 27 wherein said data packets sent onlyupon receipt of said ‘ack’, store at least one of: voice, video and datainformation.

Embodiment 29

A system according to embodiment 24 wherein the topology map defines aset of nodes and wherein the server broadcasts the paging messageintended to locate the not-found destination node only to a subset ofsaid set of nodes whose subset is characterized in that its nodes areadjacent topologically, in said map, to the topological locationidentified by the server as having belonged to the destination node.

Embodiment 30

A system according to embodiment 24 wherein the topology map defines aset of nodes and wherein the server broadcasts the paging messageintended to locate the not-found destination node only to a subset ofsaid set of nodes whose subset is characterized in that its nodes areadjacent geographically to the geographical location of the destinationnode.

Embodiment 31

A system according to embodiment 12 wherein said topology server isdistributed over a set of nodes within said network such that least onetopology map, representing at least a portion of the topology of thenetwork, resides within each of said set of nodes.

Embodiment 32

A system according to embodiment 31 wherein at least one node stores atopology map including a list of at least some of its descendants and atleast some routing information required to get to the descendants.

Embodiment 33

A system according to embodiment 32 wherein each relay positioned at aparticular level in the hierarchy stores a topology map including:

a list of all of its descendants; and

routing information which identifies, for each individual descendant insaid list, a topological location within the next level of the hierarchyto which to proceed, if it is desired to reach said individualdescendant.

Embodiment 34

A system according to embodiment 31 wherein at least one individual nodefrom among said set of nodes over which said topology server isdistributed is operative to receive a report indicating that datapackets have failed to reach a destination node not found at atopological location, within said map, identified by at least one ofsaid individual node and a descendant thereof, and responsively, tobroadcast said data packets to at least some of said individual node's“children”.

Embodiment 35

A system according to embodiment 31 wherein at least one individual nodefrom among said set of nodes over which said topology server isdistributed is operative to receive a report indicating that datapackets have failed to reach a destination node not found at atopological location, within said map, identified by at least one ofsaid individual node or a descendant thereof, and responsively, tobroadcast a paging message intended to locate said not-found destinationnode, to at least some of said individual node's “children”.

Embodiment 36

A system according to embodiment 31 wherein at least one individual nodefrom among said set of nodes is located in the core.

Embodiment 37

A system according to embodiment 31 wherein at least one individual nodefrom among said set of nodes are not located in the core.

Embodiment 38

A system according to embodiment 12 and also comprising a multi-layerhierarchical cellular network including the nodes.

Embodiment 39

A system according to embodiment 31 wherein at least one individual nodefrom among said set of nodes over which said topology server isdistributed is operative to receive a report indicating that datapackets have failed to reach a destination node not found at atopological location, within said map, identified by at least one ofsaid individual node or a descendant thereof, and responsively, tobroadcast a paging message intended to locate said not-found destinationnode, to at least some of said individual node's siblings.

Embodiment 40

A system according to embodiment 8 and also comprising corefunctionality providing a core for a cellular communication network andcommunicating with nodes of the network via a system of core-topmostnode links.

Embodiment 41

A system according to embodiment 8 wherein communication between saidlink establishment initiator, said relay manager functionality and nodesin said network occurs via said system of core-topmost node links.

Embodiment 42

A system according to embodiment 17 wherein the server broadcasts datapackets intended for a destination node not found at a topologicallocation identified in said map by the server, to at least some basestations in the topology map, each of which broadcasts to at least someof its sibling nodes in the hierarchical network.

Embodiment 43

A system according to embodiment 31 wherein at least one individual nodefrom among said set of nodes over which said topology server isdistributed is operative to receive a report indicating that datapackets have failed to reach a destination node not found at atopological location, within said map, identified by at least one ofsaid individual nodes and a descendant thereof, and responsively, tobroadcast said data packets to at least some of said individual node'ssiblings.

Embodiment 44

A system according to embodiment 8 wherein said link establishmentinitiator and said relay manager functionality each operate within atleast one relay in the network.

Embodiment 45

A system according to embodiment 8 wherein said link establishmentinitiator is connected to the core and said relay manager functionalityoperates within at least one relay in the network.

Embodiment 46

A system according to any of the preceding embodiments 1-4, 8-10, 12-25,27-43 wherein each mobile communicator in the network comprises one of:telephone, smart-phone, tablet, modem.

Embodiment 47

A system according to embodiment 46 wherein said mobile communicatorcomprises a cellular mobile communicator.

Embodiment 48

A system according to any of the preceding embodiments 1-4, 8-10, 12-25,27-43 wherein said network operates using the LTE standard.

Embodiment 49

A system according to any of the preceding embodiments 1-4, 8-10, 12-25,27-43 wherein said network operates using a WIMAX standard.

Embodiment 50

A system according to any of the preceding embodiments 1-4, 8-10, 12-25,27-43 wherein said network operates using a 3G standard.

Embodiment 51

A system according to any of the preceding embodiments 1-4, 8-10, 12-25,27-43 wherein said network operates using a WiFi standard.

Embodiment 52

A method for using a hierarchical communication network includinghierarchical communication nodes, the method comprising:

-   -   generating a topology map representing the network; and

communicating over the network based on the topology map includingdynamically changing the topology map based on handovers.

Embodiment 53

A system according to embodiment 18 wherein the server performs arecursive process in which, in a first iteration, the server broadcastsdata packets intended for a destination node not found at a topologicallocation identified in said map by the server, to at least one basestation in the topology map, each of which, in a second iteration,broadcast to at least one of their “children” nodes in the hierarchicalnetwork, and wherein the “children” nodes continue the recursive processfor at least a third iteration, down to a desired level of descendantsof said “children” nodes.

Embodiment 54

A system according to embodiment 19 wherein the server performs arecursive process in which, in a first iteration, the server broadcaststhe data packets intended for the not-found destination node to all basestations in a highest layer of the topology map, and each of said basestations, in a second iteration, broadcasts to all of their “children”nodes in the hierarchical network, and wherein the “children” nodescontinue the recursive process for at least a third iteration, down to adesired level of descendants of said “children” nodes.

Embodiment 55

A system according to embodiment 25 wherein the server performs arecursive process in which, in a first iteration, the server broadcastsa paging message intended to locate the not-found destination node toall base stations in a highest layer of the topology map, and each ofsaid base stations, in a second iteration, broadcasts the paging messageto all of their “children” nodes in the hierarchical network,

and wherein the “children” nodes continue the recursive process for atleast a third iteration, down to a desired level of descendants of said“children” nodes.

Embodiment 56

A system according to embodiment 33 wherein said routing informationdoes not identify all topological locations in all levels in thehierarchy through which to proceed in order to reach said individualdescendant.

Embodiment 57

A system according to embodiment 11 wherein saidhierarchical/non-hierarchical information pre-processor is alsooperative to cause said information from hierarchical base stations tobe processed as if said network was a non-hierarchical network having norelays.

Embodiment 58

A system according to embodiment 12 wherein topology is determinedcentralistically.

Embodiment 59

A system according to embodiment 58 wherein topology is determinedcentralistically based on a potential number of hops.

Embodiment 60

A system according to embodiment 58 wherein topology is determinedcentralistically based on a backhauling link quality scorecharacterizing at least one inter-node link.

Embodiment 61

A system according to embodiment 60 wherein said network comprises anLTE network and wherein said backhauling link quality score comprises atleast one of a SNR (signal to noise ratio) measure, a bit/block/packeterror rate measure, an RSRP measure, an RSSI measure and a RSRQ measure.

Embodiment 62

A system according to embodiment 60 wherein said network comprises a 3Gnetwork and wherein said backhauling link quality score comprises atleast one of an RSCP measure, an Ec/No measure, an RSSI measure and anSIR (signal-to interference ratio) measure.

Embodiment 63

A system according to embodiment 12 wherein topology is determined atdistributed locations over the topology.

Embodiment 64

A system according to embodiment 63 wherein topology is determined atdistributed locations over the topology based on a potential number ofhops.

Embodiment 65

A system according to embodiment 63 wherein topology is determined atdistributed locations over the topology based on a backhauling linkquality score characterizing at least one inter-node link.

Embodiment 66

A system according to embodiment 65 wherein said network comprises anLTE network and wherein said backhauling link quality score comprises atleast one of a SNR (signal to noise ratio) measure, a bit/block/packeterror rate measure, an RSRP measure, an RSSI measure and a RSRQ measure.

Embodiment 67

A system according to embodiment 65 wherein said network comprises a 3Gnetwork and wherein said backhauling link quality score comprises atleast one of an RSCP measure, an Ec/No measure, an RSSI measure and anSIR (signal-to interference ratio) measure.

Embodiment 68

A method according to embodiment 52 wherein a central manager isoperative for centralistically and dynamically changing the topology mapbased on handovers.

Embodiment 69

A method according to embodiment 52 wherein said dynamically changingthe topology map based on handovers is performed by distributedmanagement functionalities distributed over more than one node in thenetwork.

Embodiment 70

A method according to embodiment 52 wherein said dynamically changingincludes broadcasting backhauling link quality scores.

Embodiment 71

A system according to embodiment 12 and also comprising a local routingmanager operative to perform a local process in which information isrouted locally from one sibling node to another.

Embodiment 72

A system according to embodiment 12 and also comprising a local routingmanager operative to perform a local process in which information isrouted locally from one sibling tunnel to another.

Embodiment 73

A method according to embodiment 52 wherein the nodes intercommunicateusing a communication standard which defines standard handovers andwherein the topology map can be dynamically changed using the standardhandovers.

Embodiment 74

A data relaying method including:

using a relay manager to activate at least one link thereby to cause arelay to function as a node in a hierarchical cellular network; and

using a first set of radio interfaces, when said relay apparatus isdisposed at a level n of a hierarchical cellular network having a core,to provide:

a corresponding first set of uplinks from said relay apparatus to atleast one node disposed at least one level in said network which iscloser to the core than level n and

a corresponding first set of downlinks from said at least one node tosaid relay.

Embodiment 75

A data relay providing method including:

providing a relay manager operative to activate at least one linkthereby to cause the relay apparatus to function as a node in ahierarchical cellular network; and

providing a set of radio interfaces operative, when said relay apparatusis disposed at a level n of a hierarchical cellular network having acore, to provide:

a corresponding set of uplinks to said relay apparatus from at least onenode disposed at least one level in said network which is further fromthe core than level n; and

a corresponding set of downlinks from said relay to said at least onenode.

Embodiment 76

A hierarchical cellular network administration method operative toadministrate for a hierarchical cellular network having a core, thehierarchical cellular network administration method comprising:

providing a link establishment initiator operative to generate linkestablishment commands; and

providing relay manager functionality operative:

to establish at least one link between at least one relay in thehierarchical cellular network and all nodes in said cellular networkdesired to be served by said at least one relay, as per said linkestablishment commands generated by the link establishment initiator;and

to control operation of links thus established.

Embodiment 77

A mobile communication management method serving a hierarchical cellularnetwork having linked nodes, the nodes including a core, base stationsand mobile communication devices, thereby to define a topology ofcommunication links between said nodes, the method comprising:

-   -   providing a topology server including:

providing a topology learner which dynamically learns the topology and

storing the topology learned by the topology learner as at least onetopology map structured as a hierarchy having more than 2 levels.

Embodiment 78

Apparatus according to any of embodiments 2, 8, 12 wherein the networkcomprises a wireless hierarchical network.

Embodiment 79

Apparatus according to any of embodiments 2, 8, 12 2, 8, 12 wherein saidnetwork comprises an E-UTRAN network.

Also provided is a computer program product, comprising a computerusable medium or computer readable storage medium, typically tangible,having a computer readable program code embodied therein, said computerreadable program code adapted to be executed to implement any or all ofthe methods shown and described herein. It is appreciated that any orall of the computational steps shown and described herein may becomputer-implemented. The operations in accordance with the teachingsherein may be performed by a computer specially constructed for thedesired purposes or by a general purpose computer specially configuredfor the desired purpose by a computer program stored in a computerreadable storage medium.

Any suitable processor, display and input means may be used to process,display e.g. on a computer screen or other computer output device,store, and accept information such as information used by or generatedby any of the methods and apparatus shown and described herein; theabove processor, display and input means including computer programs, inaccordance with some or all of the embodiments of the present invention.Any or all functionalities of the invention shown and described hereinmay be performed by a conventional personal computer processor,workstation or other programmable device or computer or electroniccomputing device, either general-purpose or specifically constructed,used for processing; a computer display screen and/or printer and/orspeaker for displaying; machine-readable memory such as optical disks,CDROMs, magnetic-optical discs or other discs; RAMs, ROMs, EPROMs,EEPROMs, magnetic or optical or other cards, for storing, and keyboardor mouse for accepting. The term “process” as used above is intended toinclude any type of computation or manipulation or transformation ofdata represented as physical, e.g. electronic, phenomena which may occuror reside e.g. within registers and/or memories of a computer. The termprocessor includes a single processing unit or a plurality ofdistributed or remote such units.

The above devices may communicate via any conventional wired or wirelessdigital communication means, e.g. via a wired or cellular telephonenetwork or a computer network such as the Internet.

The apparatus of the present invention may include, according to certainembodiments of the invention, machine readable memory containing orotherwise storing a program of instructions which, when executed by themachine, implements some or all of the apparatus, methods, features andfunctionalities of the invention shown and described herein.Alternatively or in addition, the apparatus of the present invention mayinclude, according to certain embodiments of the invention, a program asabove which may be written in any conventional programming language, andoptionally a machine for executing the program such as but not limitedto a general purpose computer which may optionally be configured oractivated in accordance with the teachings of the present invention. Anyof the teachings incorporated herein may wherever suitable operate onsignals representative of physical objects or substances.

The embodiments referred to above, and other embodiments, are describedin detail in the next section.

Any trademark occurring in the text or drawings is the property of itsowner and occurs herein merely to explain or illustrate one example ofhow an embodiment of the invention may be implemented.

Unless specifically stated otherwise, as apparent from the followingdiscussions, it is appreciated that throughout the specificationdiscussions, utilizing terms such as, “operating”, “processing”,“computing”, “selecting”, “generating”, or the like, refer to the actionand/or processes of a computer or computing system, or processor orsimilar electronic computing device, that manipulate and/or transformdata represented as physical, such as electronic, quantities within thecomputing system's registers and/or memories, into other data similarlyrepresented as physical quantities within the computing system'smemories, registers or other such information storage, transmission ordisplay devices. The term “computer” should be broadly construed tocover any kind of electronic device with data processing capabilities,including, by way of non-limiting example, personal computers, servers,computing system, communication devices, processors (e.g. digital signalprocessor (DSP), microcontrollers, field programmable gate array (FPGA),application specific integrated circuit (ASIC), etc.) and otherelectronic computing devices.

The present invention may be described, merely for clarity, in terms ofterminology specific to particular programming languages, operatingsystems, browsers, system versions, individual products, and the like.It will be appreciated that this terminology is intended to conveygeneral principles of operation clearly and briefly, by way of example,and is not intended to limit the scope of the invention to anyparticular programming language, operating system, browser, systemversion, or individual product.

Elements separately listed herein need not be distinct components andalternatively may be the same structure.

Any suitable input device, such as but not limited to a sensor, may beused to generate or otherwise provide information received by theapparatus and methods shown and described herein. Any suitable outputdevice or display may be used to display or output information generatedby the apparatus and methods shown and described herein. Any suitableprocessor may be employed to compute or generate information asdescribed herein e.g. by providing one or more modules in the processorto perform functionalities described herein. Any suitable computerizeddata storage e.g. computer memory may be used to store informationreceived by or generated by the systems shown and described herein.Functionalities shown and described herein may be divided between aserver computer and a plurality of client computers. These or any othercomputerized components shown and described herein may communicatebetween themselves via a suitable computer network.

BRIEF DESCRIPTION OF THE DRAWINGS

Prior art FIG. 1 is a semi-pictorial diagram of a conventional cellularsystem.

Prior art FIG. 2 is a semi-pictorial diagram of a mobile ad-hoc networksystem.

Prior art FIG. 3 is a semi-pictorial diagram of an n-level hierarchicalcellular system of the invention.

Prior art FIGS. 4A-4B are simplified block diagram illustrations of a2-tier hierarchical system as described in U.S. Pat. No. 5,729,826.

Prior art FIG. 5 is a simplified block diagram illustration of a 2-tierhierarchical LAN as described in U.S. Pat. No. 5,657,317.

Prior art FIGS. 6A-6B are semi-pictorial diagrams of an n-tierhierarchical in-band multi-hop cellular network, using SM as abackhauling device.

FIG. 7 is a semi-pictorial diagram of an N-tier hierarchical radio-linkcellular system network constructed and operative in accordance withcertain embodiments of the present invention, where N may be more than2.

FIGS. 8A-8B are semi-pictorial diagrams of a routing scheme using acentralistic router for a multi-hop hierarchical cellular networksystem, all constructed and operative in accordance with certainembodiments of the present invention.

FIGS. 9A-9B are semi-pictorial diagrams of a routing scheme using adistributed router for a multi-hop hierarchical cellular network system,all constructed and operative in accordance with certain embodiments ofthe present invention.

FIG. 10 is a simplified flowchart illustration of a broadcastingselective update routing table indication method, operative inaccordance with certain embodiments of the present invention.

FIGS. 11 a-11 e are diagrams of supporting hierarchical cellular systemarchitecture in LTE, all in accordance with respective embodiments ofthe present invention.

FIGS. 12A-12B, taken together, form a table of terms used herein.

FIGS. 13 a-13 b, 14 a-14 b are diagrams of message description bearersetup procedures in LTE for a multi-hop hierarchical cellular networksystem using a centralistic router, all constructed and operative inaccordance with certain embodiments of the present invention.

FIGS. 15 a-15 b, 16 a-16 b are diagrams of message description bearersetup procedures in LTE for a multi-hop hierarchical cellular networksystem using a distributed router, all constructed and operative inaccordance with certain embodiments of the present invention.

FIG. 17 is a diagram of a message sequence, in accordance with anembodiment of the present invention, of the components in the scenariodescribed in FIG. 9 b, using a local routing manager, and based on the3GPP LTE standard, wherein the local routing manager is operative toperform a local process in which information is routed locally from onesibling node to another or from one sibling tunnel to another.

FIGS. 18A, 18B are message descriptions of a routing management methodin LTE using a centralistic routing manager, the method being operativein accordance with certain embodiments of the present invention.

FIG. 18C is a detailed message description of a routing managementmethod in LTE using a hybrid (distributed+centralistic) routing manager,the method being operative in accordance with certain embodiments of thepresent invention.

FIG. 18D is a detailed message description of a routing managementmethod in LTE using distributed routing manager, the method beingoperative in accordance with certain embodiments of the presentinvention.

FIG. 19 a is a simplified flowchart illustration of an example of acentralistic multi-objective cell routing planner method, the methodbeing operative in accordance with certain embodiments of the presentinvention.

FIG. 19 b describes an example of a distributed cell routing plannermethod, the method being operative in accordance with certainembodiments of the present invention.

In the drawings, M or m denotes a message and P denotes a sub-process orsub-method.

Computational components described and illustrated herein can beimplemented in various forms, for example, as hardware circuits such asbut not limited to custom VLSI circuits or gate arrays or programmablehardware devices such as but not limited to FPGAs, or as softwareprogram code stored on at least one intangible computer readable mediumand executable by at least one processor, or any suitable combinationthereof. A specific functional component may be formed by one particularsequence of software code, or by a plurality of such, which collectivelyact or behave or act as described herein with reference to thefunctional component in question. For example, the component may bedistributed over several code sequences such as but not limited toobjects, procedures, functions, routines and programs and may originatefrom several computer files which typically operate synergistically.

Data can be stored on one or more intangible computer readable mediastored at one or more different locations, different network nodes ordifferent storage devices at a single node or location.

It is appreciated that any computer data storage technology, includingany type of storage or memory and any type of computer components andrecording media that retain digital data used for computing for aninterval of time, and any time of information retention technology, maybe used to store the various data provided and employed herein. Suitablecomputer data storage or information retention apparatus may includeapparatus which is primary, secondary, tertiary or off-line; which is ofany type or level or amount or category of volatility, differentiation,mutability, accessibility, addressability, capacity, performance andenergy use; and which is based on any suitable technologies such assemiconductor, magnetic, optical, paper and others.

DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS

The terms used herein such as but not limited to the following terms,may be construed either in accordance with any definition thereofappearing in the prior art literature or in accordance with thespecification or drawings, or as follows:

-   -   active link: If nodes are actually transferring data between        them, the link between them is termed an “active link”. In some        technologies e.g. 4G, a link is sometimes established as an        active link in advance i.e. before it is actually needed to        transfer data.    -   base station: The term “base station”, which may be mobile or        stationary, is intended to include, for example, a cellular base        station such as but not limited to a 2G, 3G, 4G, or mobile Wimax        cellular base station, as well as a wireless access point such        as but not limited to a WiFi, Bluetooth or WiMax access point.    -   cellular: The term “cellular” is intended to include WiFi and        other technologies which have a single cell i.e. access point.        It is appreciated that access points may be interconnected        outside the scope of the cellular network, e.g. via ADSL.    -   connected: Two network nodes are “connected” if they are capable        of transferring data between them, e.g. over a wired or wireless        link.    -   core: a management and switching functionality which typically        includes but is not limited to some or all of the following        functionalities: (1) activates connections between, ultimately,        mobile communication devices; this functionality is sometimes        termed “gateway” or “serving gateway”, (2) mobility management        of mobile stations, (3) policy and/or QOS enforcement, (4) user        and/or equipment authentication. It is appreciated that the core        may be co-located with a base station e.g. if the base station        is an access point. In addition, the core may include one or        more computerized subsystems each of which perform one or more        of the functionalities described above. Alternatively, several        computerized subsystems together perform one of the        functionalities above.    -   downlink: link from core toward mobile communication device i.e.        a link in a sequence or route (also termed downlink sequence or        down-route) of one or more links connecting the core to the        device.    -   establish a link: activate a link i.e. cause a link to become        active    -   hierarchical cellular network: a communication network wherein        at least one mobile communication device is served by a first        base station, also termed herein a “relay”, which communicates        with the core via a sequence of L>=1 linked base stations        including: (a) optionally, L−1 base stations connected to one        another hence also termed herein “relays”, and (b) a second base        station which is connected to the core.    -   radio interface: apparatus using radio technology to provide a        link.    -   relay: see definition of “hierarchical network”    -   relay apparatus: synonymous to “relay”    -   mobile communication device: synonymous to “mobile        communicator”. The term “mobile computing device”, e.g. in FIG.        5, is used herein to include any mobile communication device        being a node in a communication network such as a cellular        communication network, such as but not limited to a mobile        telephone e.g. cellphone, smartphone, etc., as well as any        computer that has a wireless modem such as a laptop with a LTE        modem or a wireless tablet. It is appreciated that while many        mobile communication devices have computing ability, the        embodiments shown and described herein are applicable also to        mobile communication devices which lack computing ability.    -   served by: connected via an active link to    -   uplink: link from a mobile communication device toward the core        i.e. a link in a sequence or route (also termed uplink sequence        or up-route) of one or more links connecting the device to the        core.

The term “relay” is used herein to include a static or mobile node in acellular communication network:

(a) whose node has both base station functionality and backhauling linkfunctionality, e.g. via mobile communicator functionality. By way ofexample, backhauling link functionality is presented herein as mobilecommunicator functionality but the invention is not limited only to thistype of backhauling link type and is also applicable, mutatis mutandis,to other suitable communication link/networks including other cellularor non-cellular communication links/networks such as but not limited to2G, 3G, WiFi, WiMax or microwave point-to-point links;

(b) and which is operative to serve mobile communicators, such ascellular telephones, or other relays, and to be linked to or served bybase stations or other relays. Typically, each relay communicates viaantennae with the mobile communicators and includes a first radiomanager, and base station functionality which has a physicalback-connection to the first radio manager. The first radio managertypically has a physical connection with the relay's backhauling linkfunctionality, e.g. via mobile communicator functionality which in turncommunicates via antennae with at least one selectable (static) basestation. Typically, the first radio manager comprises a radio resourcemanager and functionality for receiving information from, and sendinginformation to, other radio managers, respectively co-located with otherrelays, and for using the information to determine whether to reject atleast one mobile communicator seeking to be served by an individual basestation associated with the individual co-located radio manager.

A particular problem characterizing mobile communication systems inwhich some mobile communicators communicate indirectly with the basestations, is thin-ness of the uplinks connecting the mobilecommunicators with the base stations. Certain embodiments of the presentinvention are helpful in overcoming this problem.

Mobile communication systems in which some mobile communicators arebeyond-range of, hence communicate indirectly with, the base stations,typically include a core associated with base stations, mobilecommunicators which may or may not be within range of the base stations,and communication relaying mobile stations which have some or all of thefunctionalities of both base stations and mobile communicators. Mobilecommunication systems in which some mobile communicators communicateindirectly with the base stations are known in the art, e.g. any of theembodiments described in co-pending Published PCT Patent ApplicationWO/2011/092698, entitled “Cellular Communication System With Moving BaseStations And Methods And Apparatus Useful In Conjunction Therewith”.

When single-hop communication is used, a communication relaying mobilestation is within the range of a base station and has a mobilecommunicator within its own range. When multi-hop communication is used,a chain of n>=2 communication relaying mobile stations are provided, thefirst of which, 1, is within the range of a base station, the last ofwhich, n, has a mobile communicator within its own range, and eachadjacent pair I, i+1 of which, for I=1, . . . n−1, is characterized inthat the (i+1)′th communication relaying mobile station is within therange of the I′th communication relaying mobile station.

Hierarchical mobile systems useful in conjunction with certainembodiments of the present invention are known and are, for example,shown in U.S. Pat. Nos. 5,729,826 and 5,657,317 and in co-pendingPublished PCT Patent Application WO/2011/092698, entitled “CellularCommunication System With Moving Base Stations And Methods And ApparatusUseful In Conjunction Therewith”.

Specifically, a particularly suitable hierarchical radio-link network,for implementing certain embodiments of the invention shown anddescribed herein, is illustrated in FIG. 7 of the above-referenced PCTApplication. U.S. Pat. No. 5,729,826 describes a 2-tier hierarchicalcellular network, where the RAs move with traffic and communicate withthe core via fixed radio ports. The RAs are provided with a high gaindirectional antenna. An example of a suitable network of this type isillustrated in prior art FIGS. 4A-4B. A moving base station may have anRH added to the processor block. U.S. Pat. No. 5,657,317 describes a2-tier hierarchical LAN. The first tier may comprise a hard wired LANcomprising radio base stations. The second tier may include a variety ofroaming computer devices such as vehicle terminals and computerterminals to peripheral devices that can bind to the mobile computingdevice and communicate with different devices on the LAN. An example ofa suitable network of this type is illustrated in prior art FIGS. 4A-4Bof the present application.

The above-mentioned co-pending published PCT Patent Applicationillustrates an n-tier hierarchical in-band multi-hop cellular networkusing SM as a backhauling device as illustrated in FIGS. 6 a-6 b of theabove-mentioned co-pending published PCT Patent Application. The RH maybe added to the rRM block.

An N-tier hierarchical radio-link network, as depicted in FIG. 7 of thepresent application, uses a radio interface for backhauling, givinghigher uplink BW capacity and better range cover.

A dynamic hierarchical cellular system, e.g. as in FIG. 7 of the presentapplication, typically has some or all of the following capabilitieswhich are typically not applicable in a conventional cellular system:

a. Finding the route to SM through several hops. Due to the dynamics ofthe system, when a message is being routed from source to destination,there is uncertainty in the position of the destination when the messagearrives; moreover, there is uncertainty in the correctness of therouting route because several nodes along the route may change theirposition.

b. Traffic ‘bottlenecks’ occur at a certain point along the backhaulingroute. A typical cellular system does not consider bottlenecks along thebackhauling route. In a hierarchical cellular system, because oflimitations in the backhauling BW, bottlenecks might occur. For example,consider that several distant users are using an RA that is connected toanother RA that might be almost overloaded due to other distant users.The result of these bottlenecks is low utilization of the radio channelsand an unsatisfying user experience.

c. Using a dynamic hierarchical cellular system adds two variables tothe routing graph, number of hops and link quality. These two variableschange rapidly, due to the dynamics of the system, and affect theutilization of the system. Hops increase delay, and link quality affectsthe backhauling BW.

d. Service management through several hops. Different services havedifferent requirements; for example, services such as voice calls arenot tolerated to latency, but require little BW; services like webbrowsing are tolerated to latency but are high BW consumers. In order tobe able to support these kinds of services, different servicerequirements and their mutual effect on each other are taken intoaccount. In some cases, interfaces might interfere with each other, forexample when they share the same limited resource, such as uplink BW ona specific route. In such cases, the more important service request istypically given advantage.

e. Scheduling of the different services. Different services havedifferent characteristics. Some use a constant bit rate and are nottolerated to delays, such as voice calls, and others are tolerated todelays, but are very ‘greedy’ in their BW consumption, and work inbursts. Once the services have been established, a special scheduler,which resides in the RA, may schedule their requests according to theirservice requirements. Moreover, different priorities may be assigned todifferent service requests. In such cases, the more important requestshould have advantage in the resource scheduler.

f. Handover management in case of a backhauling link failure

The system of FIG. 7 may be combined with any of the followingembodiments which may also operate stand-alone or with any suitableconventional cellular communication network managing system asappropriate:

Routing using topology graph in the RS (centralistic approach) is nowdescribed.

RS Typically builds a topology graph in order to control the routingprocess.

FIGS. 8A and 8B depict a usage of topology graph inside the RS in orderto establish a call between SM12 and SM06. When the destination isreached, an acknowledge message is sent back to RS. An error might beindicated by a timeout on the acknowledge message or when receiving a‘nack’ destination unreachable message.

In case of an error, any suitable method may be employed, such as butnot limited to a suitable method from among the following:

1. Broadcasting the message to all available destinations

2. Broadcasting the message to the last known branch

3. Broadcasting the message to the last known destination and itsneighbors

4. Broadcasting a page message to all available destinations

5. Broadcasting a page message to the last known branch

6. Broadcasting a page message to the last known destination and itsneighbors

7. Combining several options in several iterations

In case of an error, the destination is re-identified, and once thedestination is found, RS updates its routing tables as depicted in step20.

Broadcasting the real message is faster than sending a paging message;when using the paging message, the destination transmits an ‘ack’message to the RS, and only then the actual message is transmitted toits destination. On the other hand, broadcasting the real messageoverloads network links, due to transmission of an unnecessary datamessage, which is larger than a paging message.

In FIG. 8 a, the following links/components may provide the followingfunctionalities:

LI01:

1: Calling 06

13: ack call establishment

LI02:

2: calling 06

12: ack call establishment through RA02

RS15:

3: SEARCHING FOR 06

4: establish call for 06 through BS08 RA16, RA09

11: ack call establishment for 12 through BS01, RA02 LI03

5: Establish call to 06 through RA16, RA09

10: ack call establishment

LI04

6: Establish call to 06 through RA09

9: ack call establishement

LI05

7: Establish call to 06

8: ack call establishement

The RS15 routing table may be as follows:

Destination: Route

SM12: BS01->RA02

SM07: BS08->RA16->RA09

SM06: BS08->RA16->RA09

SM11: BS08->RA16->RA09

SM03: BS08->RA16->RA09

In FIG. 8 b, the following links/components may provide the followingfunctionalities:

LI05

1: Calling 06

22: ack call establishemnt

LI06

2: calling 06

21: ack call establishement through RA02

RS15

4: searching for 06

5: establish call for 06 through BS08 RA16, RA09

12: broadcast call establishment to 06 through BS08,RA16

19: ack call establishment for 12 through BS01, RA02

20. update graph topology

LI07

6: Establish call to 06 through RA16, RA09

11: nack call to 06

13: broadcast call establishment to 06 through RA16

18. ack call establishment

RA19

14: broadcast call establishment 06

LI09

14: broadcast call establishment to 06

17: ack call establishment

LI08

7: Establish call to 06 through RA09

10: nack call to 06

14: broadcast call establishment to 06

RA09

15: broadcast call establishment 06

RA06

15: broadcast call establishment 06

LI10

16: ack call establishment

RS15

Routing table:

Destination: Route

SM12: BS01->RA02

SM07:BS08->RA16->RA09

SM11:BS08->RA16->RA09

SM03:BS08->RA16->RA09

SM06:BS08->RA16->RA09

SM06:BS08->RA16->RA05

Routing using local routing manager in the RA (distributed approach),according to certain embodiments, is now described, with reference toFIGS. 9A-9 b, 15 a-16 b.

In FIG. 9 a, the following links/components may provide the followingfunctionalities:

LI11

-   -   1: Calling 06    -   14: ack call establishemnt

RA02

Routing table:

Destination: Next

SM12: *

SM07:BS01

SM06:BS01

SM11:BS01

SM03:BS01

LI12

2: calling 06

13: ack 12

BS01

Routing table:

Destination: Next

SM12: RA02

SM07:RS

SM06:RS

SM11:RS

SM03:RS

BS08

Routing table:

Destination: Next

SM12: RS

SM07:RA16

SM06:RA16

SM11:RA16

SM03:RA16

L113

5: calling 06

10: ack 12

SM16

Routing table:

Destination: Next

SM12: BS08

SM07:*

SM06:RA09

SM11:RA05

SM03:RA09

LI14

17: Calling 11

20: ack 03

LI15

6: calling 06

9: ack 12

16: calling 11

21 ack 03

RA09

Routing table:

Destination: Next

SM12: BS08

SM07:RA16

SM06:*

SM11:RA16

SM03:*

LI16

15: Establish call 11

17: ack call establishment

LI17

7: Establish call to 06

8: ack 12

RA05

Routing table:

Destination: Next

SM12: BS08

SM07:RA16

SM06:RA16

SM11:*

SM03:RA16

LI18

18: Establish call to 11

19: ack 03

In FIG. 9 a, the following links/components may provide the followingfunctionalities:

LI17

1: Calling 06

16: ack call establishemnt

LI18

2: calling 06

15: ack 12

RA01

Routing table:

Destination: Next

SM12: *

SM07:BS01

SM06:BS01

SM11:BS01

SM03:BS01

BS01

3: calling 06

14: ack 12

Routing table:

Destination: Next

SM12: RA02

SM07:RS

SM06:RS

SM11:RS

SM03:RS

RS15

4: calling 06

13: ack 12

Routing table:

Destination: Next

SM12: BS01

SM07:BS08

SM06:BS08

SM11:BS08

SM03:BS08

BS08

Routing table:

Destination: Next

SM12: RS

SM07:RA16

SM06:RA16

SM11:RA16

SM03:RA16

LI19

5: calling 06

12: ack 12

LI20

20: ack call establishment

RA16

8: broadcasting calling 06

13: update tables

19: broadcasting calling 07

21:update tables

Routing table:

Destination: Next

SM12: BS08

SM07:?->*

SM06:RA09->RA05

SM11:RA05

SM03:RA09

LI21

6: calling 06

9:unknown 06

14: update table

22: update table

LI22

8: broadcasting calling 06

11: ack 12

18: broadcasting calling 07

21: ack 11

RA05

9: broadcasting calling 06

11: update table 18 broadcasting calling 07

21: update table

Routing table:

Destination: Next

SM12: BS08

SM07:?->RA07

SM06:?->*

SM11:*

SM03:RA16

LI25

17: calling 07

21: ack calling establishment

LI24

10: ack 12

RA09

7: broadcasting 06

15: update table

23: update table

Routing table:

Destination: Next

SM12: BS08

SM07:?->RA16

SM06:?->RA16

SM11:RA16

SM03:*

LI23

15: Establish call 11

17: ack call establishment

In routing using the local routing manager alternative, as depicted inFIG. 9A, each node, or only RA, comprises a local routing manager whichholds the “next” routing table for each destination. Typically, this isimplemented in that the table contains a row for each destinationindicating the next hop, in order to reach its destination.Alternatively, each node holds a routing table only to its descendents,while other destinations are routed by default through the RS. Anotheralternative is that each node holds only its relative neighborhoodgraph, e.g. as described in Toussaint in “The Relative NeighborhoodGraph Of A Finite Planner Set”, Pattern Recognition, vol. 12 No. 4(1980).

The routing table updates are broadcast throughout the entire network.Optionally, the updates are sent only to the nodes that were affected bythe change. FIG. 10 depicts a method to broadcast only to the affectedneighbors.

When the destination is reached an ‘ack’ message is sent back to thecreator of the message. An error might be indicated by a timeout on the‘ack’ message, or when receiving a ‘nack’ [destination unreachable]message.

In case of an error, any or all of the following methods may beintroduced:

1. Broadcasting the message to all available destinations

2. Broadcasting the message to the last known branch, e.g. as per FIG.11 b

3. Broadcasting the message to the last known destination and itsneighbors

4. Broadcasting a page message to all available destinations

5. Broadcasting a page message to the last known branch

6. Broadcasting a page message to the last known destination and itsneighbors

7. Combining several options in several iterations

In case of an error when destination is found, the local routing tablesare updated, as depicted in FIG. 9 b in steps 11, 13, 15, 21, 22 and 23.

Distributed embodiments, while more complex than centralisticembodiments, are particularly useful in applications in which any of thefollowing are important: avoiding single point of failure, in case ofdisconnection from the core, the network may still be able to giveservice; robustness to changes, only small fraction of the changesaffect the entire network; faster, no need to broadcast the error allthe way to the core.

Supporting hierarchical cellular system architecture in LTE, accordingto certain embodiments, is now described.

Conventional LTE cellular system architecture is depicted in FIG. 11 a,comprising user equipment, UE, a base station, eNodeB, mobilitymanagement entity (MME), serving gateway, S-GW and packet data networkgateway, P-GW. There are many alternatives to implement a hierarchicalcellular system in LTE as depicted in FIGS. 11 b-11 e. The UE maycompromise all or many functionalities of an SM and the eNodeB maycompromise all or many functionalities of a BS.

FIG. 11 b depicts implementation of a hierarchical cellular system usinga relay server (RS) that is connected to a Relay MME and the P-GWgateway. The relay MME from the point of view of the core is aconventional MME that can be connected to a conventional MME as analternative MME. The relay MME is responsible for controlling signalingbetween the core network and the UE for UEs that are camping on a RA orto the control signals that are related to RA themselves. The relayserver is responsible for specific hierarchical network implementations,such as network optimizations algorithms, routing algorithms and messagecoupling\decoupling.

FIG. 11 c depicts another alternative of implementation of ahierarchical cellular system in LTE. The difference in relation to FIG.20 b is that the RS is connected to a virtual BS or a BS proxy thatserves as a conventional BS from the core point of view, and an RA fromthe RS point of view. The RS is responsible for handling all tasks inthe first option, in addition to handling mobility and controlling ofthe RAs.

FIG. 11 d depicts another alternative of implementation of ahierarchical cellular system in LTE. This alternative is quite differentfrom the first two alternatives. The filter relay server entity residesbetween the RA or the BS and the core and is responsible to filtermessages that come from entities that reside in a hierarchical network,and entities that reside in the typical cellular network. Messages thatcome from a typical cellular network are forwarded as usual, while relaymessages are forwarded to a BS proxy which is responsible for decouplingthem and sending them as a usual system message to the MME.

FIG. 11 e depicts another alternative of implementation of ahierarchical cellular system in LTE.

This alternative uses the same filter relay server entity as in FIG. 11d. Relay messages are forwarded to the relay MME, while other messagesare forwarded as usual. The relay MME comprises both methods that werepart of the relay MME in FIG. 11 c, and also methods that were part ofthe RS in FIG. 11 c.

More generally, according to certain embodiments, a relay apparatus isprovided, including a relay manager and a set of radio interfacesoperative, when said relay is disposed at a level n of a cellularnetwork having a core, to provide a corresponding set of uplinks fromsaid relay to at least one node disposed at least one level in thenetwork which is closer to the core than level n and a corresponding setof downlinks from said at least one node to said relay.

Alternatively or in addition, the relay apparatus may include a relaymanager; and a set of radio interfaces operative, when said relay isdisposed at a level n of a cellular network having a core, to provide acorresponding set of uplinks to said relay from at least one nodedisposed at least one level in the network which is further from thecore than level n; and a corresponding set of downlinks from said relayto said at least one node.

Optionally, the apparatus also comprises a second set of radiointerfaces operative, when said relay is disposed at a level n of acellular network having a core, to provide a corresponding second set ofuplinks to said relay from at least one node disposed at least one levelin the network which is further from the core than level n; and acorresponding second set of downlinks from said relay to said at leastone node.

This enables to enlarge the overall network capacity by adding more DLresources to the relay.

A suitable data relaying method may include providing a relay managerand a set of radio interfaces; disposing said relay at a level n of acellular network having a core so as to provide a corresponding set ofuplinks from said relay to at least one node disposed at least one levelin the network which is closer to the core than level n and acorresponding set of downlinks from said at least one node to saidrelay.

Optionally, said set of uplinks and downlinks connect said relay to asingle node disposed at a level in the network which is closer to thecore than level n.

Optionally, said set of uplinks and downlinks connect said relay to aset of more than one nodes disposed at least one level in the networkwhich is closer to the core than level n.

Optionally, said set of uplinks and downlinks connect said relay to acorresponding set of nodes disposed at least one level in the networkwhich is closer to the core than level n.

The term Relay MME typically refers to manager functionalityestablishing and controlling operation of the links between a relay andall nodes served thereby. Typically, links are established as per a linkestablishment command generated by a link establishment initiator whichmay be incorporated into a processor-based “relay server” which may alsoincorporate other functionalities.

MME in LTE protocol is an example of a mobility manager for a cellularnetwork.

Optionally, a hierarchical cellular network administration system isprovided which is operative to administrate for a hierarchical cellularnetwork, the system comprising a link establishment initiator operativeto generate link establishment commands; and relay manager functionalityoperative to establish links between each of at least one relays in thecellular network and all nodes in said cellular network served therebyas per said link establishment commands generated by the linkestablishment initiator and to control operation of the links.

Optionally, said link establishment initiator is incorporated within aserver located in the core of the network and wherein said server isalso operative to control the core's mobility manager including causingthe mobility manager to provide said relay manager functionality.

Optionally, the system may also comprise a hierarchical/non-hierarchicalinformation pre-processor, wherein said network includes at least onenon-hierarchical base station which is operative to communicate withmobile communication devices and not with relays and at least onehierarchical base station which communicates with at least one relay andwherein said core includes a mobility manager and a serving gatewaycommunicating with said mobility manager and, via saidhierarchical/non-hierarchical information pre-processor, with at leastone base station, said hierarchical/non-hierarchical informationpre-processor being operative to receive information from at least onenon-hierarchical base station and from at least one hierarchical basestation and to send information received from hierarchical basestations, but not information from non-hierarchical base stations, tothe relay manager functionality.

Optionally, said hierarchical/non-hierarchical information pre-processoris also operative to cause said information from non-hierarchical basestations to be processed as if said network were a non-hierarchicalnetwork having no relays.

The term “Hierarchical network” is intended to include any networkhaving at least one relay uplinking to a base station and downlinking,directly or ultimately (i.e. via other relays) to at least one cellularcommunication device, such that the network supports more than 2 levelsor tiers of wireless communication namely core-base station, at leastone relay, communication device, as opposed to conventional networksincluding 2 or less levels or tiers e.g. a core, base station, relayincapable of linking to another relay e.g. incapable of providingmulti-hop functionality, and mobile communication device.

The term “multi-hop functionality” is intended to include applicationsin which a mobile communication device communicates with a base stationvia more than one relay.

The term “non-hierarchical base station” may include base stations whichdo not support multi-hop functionality and/or may include base stationswhich communicate only with mobile communication devices.

The term “hierarchical base station” is intended to include basestations which do support multi-hop functionality and/or may includebase stations which communicate not only with mobile communicationdevices but also with relays.

Optionally, the system also comprises core functionality providing acore for a cellular communication network and communicating with nodesof the network via a system of core-topmost node links.

Optionally, communication between said link establishment initiator,said relay manager functionality and nodes in said network occurs viasaid system of core-topmost node links.

According to certain embodiments, a mobile communication managementsystem may be provided, serving a mobile communication network havinglinked nodes, the nodes including a core, base stations and mobilecommunication devices, thereby to define a topology of communicationlinks between said nodes, the system comprising a topology server whichincludes a topology learner which dynamically learns the topology and atopology storing functionality which stores the topology as at least onetopology map structured as a hierarchy of depth exceeding 2.

The network may comprise a multi-layer hierarchical cellular network. Anexample of a suitable multi-layer hierarchical cellular network isdescribed herein with reference to FIG. 7.

Typically, said topology server resides in a single node within saidnetwork. Typically, said single node in which said topology serverresides comprises the core.

Typically, said server stores the topology as a hierarchy of dynamicdepth.

Typically, said server uses said topology to dynamically routeinformation through the downlinks to arrive at a desired destination.

Typically, said server dynamically routes by indicating network nodesvia which the information is to arrive at the desired destination.

According to certain embodiments, the topology server is centrallylocated and a “flooding” operation is performed if a destination nodesuch as a mobile communicator is not found at a topological locationidentified by the server. In “flooding”, a broadcast such as actual datapackets or a paging message seeking the destination to which to send theactual data packets, goes out to the entire network in order to find the“lost” destination node. Alternatively, in “semi-flooding”, thebroadcast goes out to only a subset of the network, such as only tonodes geographically or topologically adjacent to the “lost” destinationnode. Sending only a paging message rather than the data itself resultsin low latency i.e. slowness but lessens the load on the network, and isparticularly, but not exclusively, suited for data (non-voice)applications. Conversely, sending, not merely a paging message, butrather the data itself, results in high latency, but increases the loadon the network, and is particularly, but not exclusively, suited forvoice applications.

Typically, the server broadcasts data packets intended for a destinationnode not found at a topological location identified by the server, to atleast some base stations in the topology, each of which broadcast to atleast some of their “children” nodes in the topology. It is appreciatedthat the term “at least some” as used throughout the presentspecification and claims is also, of course, intended to include thespecial instance of “at least one”.

Typically, the server broadcasts the data packets intended for thenot-found destination node to all base stations in the topology, andeach of said base stations broadcasts to all of their “children” nodesin the topology.

Typically, said not-found destination node sends an ‘ack’ to his fathernode in the topology and said ‘ack’ is transmitted through the topologyto the topology server. Typically, said data packets store voiceinformation.

Typically, the topology defines a set of nodes and wherein the serverbroadcasts data packets intended for the not-found destination node onlyto a subset of said set of nodes which subset is characterized in thatits nodes are adjacent topologically to the topological locationidentified by the server as having belonged to the destination node.

Typically, the topology defines a set of nodes wherein the serverbroadcasts data packets intended for the not-found destination node onlyto a subset of said set of nodes which subset is characterized in thatits nodes are adjacent geographically to the topological locationidentified by the server as having belonged to the destination node.

Typically, the server broadcasts the paging message intended to locate adestination node not found at a topological location identified by theserver, to at least some base stations in the topology, each of whichbroadcasts to at least some of their “children” nodes in the topology.

Typically, the server broadcasts the paging message intended to locatethe not-found destination node to all base stations in the topology, andeach of said base stations broadcasts the paging message to all of their“children” nodes in the topology. Typically, said not-found destinationnode sends an ‘ack’ to his father node in the topology and said ‘ack’ istransmitted through the topology to the topology server.

Typically, only upon receipt of said ‘ack’, data packets intended forsaid destination node which sent said ‘ack’, are sent to saiddestination node.

Typically, said data packets sent only upon receipt of said ‘ack’, storenon-voice data.

Typically, the topology defines a set of nodes, wherein the serverbroadcasts the paging message intended to locate the not-founddestination node only to a subset of said set of nodes whose subset ischaracterized in that its nodes are adjacent topologically to thetopological location identified by the server as having belonged to thedestination node.

Typically, the topology defines a set of nodes, wherein the serverbroadcasts the paging message intended to locate the not-founddestination node only to a subset of said set of nodes whose subset ischaracterized in that its nodes are adjacent geographically to thetopological location identified by the server as having belonged to thedestination node.

According to certain embodiments, the topology server is distributedthrough the network, rather than being centrally located in a singletopological location in the network, such as the core.

Typically, said topology server is distributed over a plurality of nodeswithin said network such that least one topology map representing atleast a portion of the topology of the network resides within each ofsaid plurality of nodes.

Typically, each relay includes a topology map including a list of atleast some of its descendants and at least some of the routinginformation required to get to the descendants.

Typically, each relay positioned at a particular level in the hierarchyincludes a topology map including a list of all of its descendants, androuting information which identifies, for each individual descendant insaid list, a topological location within the next level of the hierarchyto which to proceed, if it is desired to reach said individualdescendant but does not identify all topological locations in all levelsthrough which to proceed in order to reach said individual descendant.

Typically, at least one individual node from among said plurality ofnodes over which said topology server is distributed is operative toreceive a report indicating that data packets have failed to reach adestination node not found at a topological location identified by atleast one of said individual node and a descendant thereof, andresponsively, to broadcast said data packets to at least some of saidindividual node's “children” nodes.

Typically at least one individual node from among said plurality ofnodes over which said topology server is distributed is operative toreceive a report indicating that data packets have failed to reach adestination node not found at a topological location identified by atleast one of said individual node or a descendant thereof, andresponsively, to broadcast a paging message intended to locate saidnot-found destination node, to at least some of said individual node's“children” nodes.

Typically, said individual node is located in the core.

Typically, said at least one individual node comprises several nodeswhich are not located in the core.

The terms in the table of FIG. 12 may be construed either in accordancewith any definition thereof appearing in the prior art literature or inaccordance with the specification, or as stipulated in the table.

The present invention is intended to include a base station effectingany portion of any of the functionalities shown and described herein.

The present invention is also intended to include a handset effectingany portion of any of the functionalities shown and described herein.

It is appreciated that various embodiments of the invention e.g. asshown and described herein are useful in conjunction with a mobilecommunication network system operative in conjunction with a corenetwork including a core device and at least one static base station,the system comprising a plurality of base stations; and a population ofmobile stations communicating via antennae with the base stations; thebase stations including at least one moving base station whichcommunicates via antennae with the mobile stations and includes basestation functionality, a first radio manager and mobile stationfunctionality all co-located with the base station functionality, thebase station functionality having a physical back-connection to thefirst radio manager, the first radio manager having a physicalconnection with the mobile station functionality, the mobile stationfunctionality communicating via antennae with at least one selectablestatic base station, wherein the first radio manager comprises a radioresource manager; and functionality for receiving information from, andsending information to, other radio managers, respectively co-locatedwith other moving base stations, and for using the information todetermine whether to reject at least one mobile station seeking to beserved by an individual base station associated with the individualco-located radio manager.

It is appreciated that various embodiments of the invention e.g. asshown and described herein are suitable for multi-hop applications inwhich at least one relay is served by another relay rather than beingserved directly by a base station.

It is appreciated that various embodiments of the invention e.g. asshown and described herein are suitable for application to a widevariety of mobile communication technologies. For example:

3GPP Long Term Evolution (LTE), is a standard in mobile networktechnology which provides the following features:

Peak download rates of 326.4 Mbit/s for 4×4 antennae, and 172.8 Mbit/sfor 2×2 antennae (utilizing 20 MHz of spectrum).[8]

Peak upload rates of 86.4 Mbit/s for every 20 MHz of spectrum using asingle antenna. [8]

Five different terminal classes have been defined from a voice centricclass up to a high end terminal that supports the peak data rates. Allterminals will be able to process 20 MHz bandwidth.

At least 200 active users in every 5 MHz cell. (Specifically, 200 activedata clients)

Sub-5 ms latency for small IP packets

Increased spectrum flexibility, with supported spectrum slices as smallas 1.4 MHz and as large as 20 MHz (W-CDMA requires 5 MHz slices, leadingto some problems with roll-outs of the technology in countries where 5MHz is a commonly allocated amount of spectrum, and is frequentlyalready in use with legacy standards such as 2G GSM and cdmaOne.)Limiting sizes to 5 MHz also limited the amount of bandwidth perhandset.

In the 900 MHz frequency band to be used in rural areas, supporting anoptimal cell size of 5 km, 30 km sizes with reasonable performance, andup to 100 km cell sizes supported with acceptable performance. In cityand urban areas, higher frequency bands (such as 2.6 GHz in EU) are usedto support high speed mobile broadband. In this case, cell sizes may be1 km or even less.

Support for mobility. High performance mobile data is possible at speedsof up to 350 km/h, or even up to 500 km/h, depending on the frequencyband used.[9]

Co-existence with legacy standards (users can transparently start a callor transfer data in an area using an LTE standard, and, should coveragebe unavailable, continue the operation without any action on their partusing GSM/GPRS or W-CDMA-based UMTS or even 3GPP2 networks such ascdmaOne or CDMA2000).

Support for MBSFN (Multicast Broadcast Single Frequency Network). Thisfeature can deliver services such as Mobile TV using the LTEinfrastructure, and is a competitor for DVB-H-based TV broadcast.

The features of E-UTRAN, the air interface of LTE, are:

Peak download rates up to 292 Mbit/s and upload rates up to 71 Mbit/sdepending on the user equipment category.

Low data transfer latencies (sub-5 ms latency for small IP packets inoptimal conditions), lower latencies for handover and connection setuptime than with previous radio access technologies.

Support for terminals moving at up to 350 km/h or 500 km/h depending onthe frequency band.

Support for both FDD and TDD duplexes as well as half-duplex FDD withthe same radio access technology.

Support for all frequency bands currently used by IMT systems by ITU-R.

Flexible bandwidth: 1.4 MHz, 3 MHz, 5 MHz 15 MHz and 20 MHz arestandardized.

Support for cell sizes from tens of metres radius (femto and picocells)up to 100 km radius macrocells

Simplified architecture: The network side of EUTRAN is composed only bythe enodeBs

Support for inter-operation with other systems (e.g. GSM/EDGE, UMTS,CDMA2000, WiMAX . . . )

Packet switched radio interface.

It is appreciated that various embodiments of the invention e.g. asshown and described herein are suitable for application to LTE and/orEUTRAN technology as well as to technologies possessing some but not allof the above features.

LTE Advanced is a 4th generation standard (4G)[2] of radio technologiesdesigned to increase the capacity and speed of mobile telephonenetworks. Its features may include some or all of:

Relay Nodes

UE Dual TX antenna solutions for SU-MIMO and diversity MIMO

Scalable system bandwidth exceeding 20 MHz, Potentially up to 100 MHz

Local area optimization of air interface

Nomadic/Local Area network and mobility solutions

Flexible Spectrum Usage

Cognitive radio

Automatic and autonomous network configuration and operation

Enhanced precoding and forward error correction

Interference management and suppression

Asymmetric bandwidth assignment for FDD

Hybrid OFDMA and SC-FDMA in uplink

UL/DL inter eNB coordinated MIMO

It is appreciated that various embodiments of the invention e.g. asshown and described herein are suitable for application to LTE-Advancedtechnology as well as to technologies possessing some but not all of theabove features.

WiMAX (Worldwide Interoperability for Microwave Access) is atelecommunications protocol that provides fixed and fully mobileInternet access. Features include:

Adding support for mobility (soft and hard handover between basestations). This is seen as one of the most important aspects of802.16e-2005, and is the very basis of Mobile WiMAX.

Scaling of the Fast Fourier transform (FFT) to the channel bandwidth inorder to keep the carrier spacing constant across different channelbandwidths (typically 1.25 MHz, 5 MHz, 10 MHz or 20 MHz). Constantcarrier spacing results in a higher spectrum efficiency in widechannels, and a cost reduction in narrow channels. This is also known asScalable OFDMA (SOFDMA). Other bands not multiples of 1.25 MHz aredefined in the standard, but because the allowed FFT subcarrier numbersare only 128, 512, 1024 and 2048, other frequency bands will not haveexactly the same carrier spacing, which might not be optimal forimplementations.

Advanced antenna diversity schemes, and hybrid automatic repeat-request(HARQ)

Adaptive Antenna Systems (AAS) and MIMO technology

Denser sub-channelization, thereby improving indoor penetration

Introducing Turbo Coding and Low-Density Parity Check (LDPC)

Introducing downlink sub-channelization, allowing administrators totrade coverage for capacity or vice versa

Adding an extra QoS class for VoIP applications.

It is appreciated that various embodiments of the invention e.g. asshown and described herein are suitable for application to WiMaxtechnology as well as to technologies possessing some but not all of theabove features.

Reference is made again to FIG. 8 a. FIG. 8 a is an example, accordingto an embodiment of the present invention, of a communication betweenSM12 and SM06, SM12 is connected to the core network through RA02 usingcommunication radio link [LI01], and RA02 is connected to the corenetwork through BS01 using communication radio link LI02. In a similarway SM06 connects to the core network through RA09, RA16 and BS08.

In this example SM12 initiates a communication session with SM06 by, forexample, calling SM06. The request is forwarded through RA02, BS01 overradio links LI01 and LI02 to the core network through the relay server.SM06 is searched and located as attached to RA09. A communication linkor path to SM06 is established in 3-hops using LI03, LI04 and the radiolink between SM06 and its serving base station RA09, LI05. After thecommunication link between the core and SM06 has been established, anacknowledgement message is typically sent to SM12 using thecommunication link between SM12 and the core. After the communicationlink between SM12 and SM06 has been established, they are able tocommunicate.

FIGS. 13 a-14 b depict an example message sequence of components, basedon the scenario of FIG. 8 a, suitable for supporting a packet in aparticular flow. To create a bearer to support the specific requirements(e.g. some or all of jitter, priority, delay) of the flow and theprivilege of the user, the protocol may be based on the 3GPP LTEstandard.

Regular base stations do not take into consideration the impact of amulti-hop network; the assumption is that the backhauling bandwidth isreliable enough. However, in the case of a multi-hop network, that isnot always true. For such cases, any or all of several methods may beemployed to keep the backhauling bandwidth as reliable as possible:

SM12 in FIGS. 13 a-13 b initiates the procedure by requesting adedicated bearer. This method may apply when the user equipment needs adifferent packet handling for example real-time VoIP. The procedurebegins with a request for a dedicated bearer message [M801]. The messageis processed by the serving base station of SM12, RA02, where itforwards the request [M802] to the relay server RS15. The relay serveranalyses the request and affiliates it with its local DB (e.g. topology,load) that enables it to make smart decisions to assess in the bearerallocation the request for hierarchical networks. In this example therelay server creates a dedicated bearer for each hop; in another exampleit may order something else. The relay server requests [M803] adedicated bearer for the serving base station of SM12 from the corenetwork, which triggers a standard dedicated bearer allocation for RA02.Following this, the relay server sends the request for a dedicatedbearer for SM12.

FIGS. 14 a-14 b, taken together, describe in more detail, the scenariodescribed in FIG. 8 a, in accordance with an embodiment of the presentinvention. The core network creates a dedicated bearer between the coreand SM06 in order to enable communication with SM12 which is of anapplication-mandated quality, following which the core typically sends amessage to the serving base station of SM06, RA05 using the relay serveras a proxy. The relay server may create an additional extra 2 dedicatedbearers in order to support the core network request between the servingbase station of RA05, RA16 [M834], which is a relay station, and betweenRA05 and the core network [M844]. The request then triggers a standardflow of allocation of a dedicated bearer for RA02 and RA16,respectively.

FIG. 9 a depicts communication between SM12 and SM06, SM12 is connectedto the core network through RA02 using communication radio link [LI12],and RA02 is connected to the core network through BS01 usingcommunication radio link LI18. SM06 connects to the core network throughRA09, RA16 and BS08.

In this example SM12 initiates a communication session with SM06 by, forexample, calling SM06. The request is forwarded to RA02; SM06 is notunder RA02, so the request is forwarded to BS01 over radio links LI01;SM06 is not under BS01, so the request is forwarded over radio link LI02to the core network through the relay server. SM06 is searched andlocated as attached to RA09. A communication link or path to SM06 isestablished in 3-hops using LI03, LI04 and the radio link between SM06and its serving base station RA09, LI05. After the communication linkbetween the core and SM06 is established, an acknowledgement message maybe sent to SM12 using the communication link between SM12 and the core.After the communication link between SM12 and SM06 has been established,SM12 and SM06 are able to communicate.

Another example of using a local routing manager in the RA is depictedin FIG. 9B. In this example, SM11 initiates a communication session withSM07, and the request is forwarded to its serving base station, RA05.SM07 is not under RA05 and the request is forwarded to its serving basestation, RA16. SM07 is under RA16, a communication is establishedbetween SM07 and RA16 over LI20 and an acknowledgment is sent to SM11over LI22 and LI25. After the communication has been established, SM11and SM07 are able to communicate.

FIGS. 15 a-15 b, taken together, depict the message sequence of thecomponents, in the scenario described in FIG. 9 a, in accordance with anembodiment of the present invention. In order to support packet in aparticular flow, a bearer is created to support the specificrequirements (e.g. one or more of jitter, priority, delay) of the flowand the privilege of the user. The protocol is based on the 3GPP LTEstandard.

The procedure may be similar to the one previously described in FIGS. 8a-8 b, however now the method is carried out locally, using a relaymanager that resides inside the RA.

SM12 initiates the procedure by requesting a dedicated bearer. Thismethod may apply when the user equipment needs a different packethandling, for example real-time VoIP. The procedure begins with requestfor a dedicated bearer message[M01]. the message is processed by theserving base station of SM12, RA05, which triggers a request [M02] for adedicated bearer for the relay serving base station RA05. The dedicatedbearer for the relay station is set using a standard 3GPP method[M02-M14]. Only then, typically, the serving relay base station [RA05]sends the bearer allocation request for the SM12 [M26] using a GPRStunnel between the RA02 and the core network. It then triggers astandard bearer setup procedure as depicted in messages [M15-M25].

FIGS. 16 a-16 b describe a continuation of the scenario of FIG. 9 a. Thecore network creates a dedicated bearer between the core and SM06 inorder to enable communication with SM12 of an application-mandatedquality. The core sends a message to the serving base station of SM06,RA05 using a GPRS tunnel, the relay serving base stations that are onthe path to the designated device, in the example RA16, inspects themessage [m29] and requests an additional bearer to support the newdedicated bearer for SM06 e.g. as described in messages [m30-m40]. RA16then forwards [m41] the request to the serving base station of SM06which is the relay agent RA05. RA05 requests an additional dedicatedbearer to support the dedicated bearer of SM06 [m42-m52]. RA05 may thencontinue the bearer setup procedure that was initialized by the corenetwork in [m28] in [m53], which ends up in [m58] in a successfuldedicated bearer setup between the core and SM06.

FIG. 17 depicts a message sequence, in accordance with an embodiment ofthe present invention, of the components in the scenario described inFIG. 9 b, using a local routing manager, and based on the 3GPP LTEstandard. In the example, SM11 communicates with SM07, and RA16 is thelowest common node, in the hierarchical cellular network. RA16 forwardsmessages that are designated to a node that is under its branch, from anode that is under its branch. Every relay node has a message inspectioncapability, enabling it to infer its sibling nodes (RA, SM) and theavailable tunnels, source and destination, by inspecting the S1APmessages of its siblings. On each node, the sibling nodes may be storedin a local table. SM11 initiates the procedure by requesting bearermodification that contains a traffic filter template or traffic flowtemplate (TFT) with its source address and designated node address SM07.Typically, the TFT is associated with the bearer in memory, and is usedin order to correlate packets to bearer.

On a hop by hop basis, each node inspects the message. If the designatedaddress is under the node; the node stores the filter and waits foractivation of the new bearer in order to get the GPRS tunnel ID.Afterwards, the node is able to locally route messages, that are sentfrom a source address over a GPRS tunnel to a designated address overanother tunnel. In the example depicted in FIG. 17, RA05 receives thebearer modification request [m50], SM07 is not under RA05's branch, andRA05 forwards the request to its serving base station, RA16. SM07 isunder RA16 branch, so it stores information that is considered useful,for example TFT, and forwards the request to its serving base station,BS08. In case there are no errors, a session management request [m65]may be sent from the core through BS08 to the serving base station ofSM11, RA05 containing the new tunnel ID. RA16 stores the tunnel ID ofSM11 for future use.

Information that is considered useful may for example includeinformation which allows bandwidth allocation to be conserved, or whichallows operation in case of disconnection from the core network, e.g. bythe ability to shortcut including avoiding sending data back and forthand avoiding situations in which data packets cross a common nodebetween source and designated tunnel. Information that is considereduseful may for example include information which allows a source tunnelto be connected to a designated tunnel without involving the cellularcore (e.g., the TFTs of the source tunnel and of the designated tunnel).

Another tunnel [m72] is built between SM07 and SM11. Normally themessage is sent by a service residing in the core network, or by thedesignated user, but may be triggered by a local RA. RA16 stores thetunnel ID and the TFT of the new tunnel [p03]. RA16 maps [p04] sourcetunnel [m78], indicated by GTP header, to designated tunnel [m81]. Inthe example, the source tunnel [m78] is encapsulated by another relaytunnel [m79].

In a conventional cellular network, mobile user equipment typicallyattaches to the base station with the highest radio power; from therethe base station can hand over the mobile equipment to another basestation in case of load on the current serving base station, or in acase that there is a better serving base station, in this case, currentserving base station will move the user equipment to the better one.

In a hierarchical cellular network, it may be desired to maximize usageof the backhauling resource. This may be done using centralistictopology building dynamic methods that take into account aspects of userrequirements in real-time and change the topology by ordering onhandovers, or by using a greedy distributed local manager that listensto broadcast messages that give the backhauling grade of the nearneighbors (this may be reported using the measurement report of thedifferent UE attached to the serving base station) or by getting nearneighbors' grades from a centralistic manager by giving the cell IDs asreceived.

FIGS. 18 a, 18 b describe the topology management method using acentralistic routing manager. Arena measurement reports may be reportedto a centralistic routing manager, and measurement reports may be usedwith a combination of network throughput and drop rate statistics inorder to estimate the potential capacity of each potential link. Apotential link is between a UE (SM or RA) and an eNB when said UE sendsa measurement report on said eNB to its serving eNB (RA or BS) thatincludes a measurement report of the said UE on its current serving eNB.

FIG. 18 a uses the S1 interface in order to request an HO. Themeasurement reports are aggregated by the various relay agents (RA16 andRA02 in the example) and reported [M1109], [M1111]. The relay serverruns the Topology planner [p1112] that affiliates measurement reportswith network traffic statistics, drops statistics, service requirementsand any valuable data resource (for example GIS) that can help to getsmart decisions; the different metrics are used in order to giveintermediate grades for each link. Then the metrics are sent to amulti-objective, like a scheduler, that orders handover, if needed, e.g.as described herein with reference to FIG. 19 a. The handover orders aresent back to the serving base station [M1113] and start the standardhandover procedure [M1114-M1120].

FIG. 18 b is similar to FIG. 18 a except that the embodiment of FIG. 18b uses a standard X2 handover procedure [M1133-M1137].

FIG. 18 c depicts a topology management method that combines both acentralistic manager and local routing managers, as in the example inFIG. 18 a. Typically, the centralistic manager is responsible forcomputing the backhauling quality grade of each network node, and thensends the quality grade to the clients (RA). According to thebackhauling quality grade of its neighbors and radio measurementmessages, a local routing manager can order handover, if required by theapplication. For example, SM12 sends a measurement report [M1128] thatindicates that it hears RA02 and RA16, the quality grade of the powerfor SM12->RA16=4, SM12->RA02=6, so SM12 does not handover to RA02. Therelay service indicates that [M1132] RA02 backhauling quality grade=2and RA16 backhauling quality grade is 5. Now, the total quality gradeSM12->RA02->core=8 and SM12->RA16->core=9 and therefore RA16 sends ahandover required[M1133] message and handover SM12 to RA02, e.g. asdescribed herein with reference to FIG. 19 b.

FIG. 18 d depicts a distributed topology management method. In order tobuild the optimal routing tree, the method of FIG. 18 d uses a localrouting greedy manager, and backhauling grades may be exchanged betweenthe different relay agents by sending broadcast messages [m1144, m1160].The local routing manager computes its backhauling quality grade e.g. byadding its current weight to the quality grade of its backhauling link.It is optional to add a relay server in order to consider additionalparameters [m1153, m1154]. For example, SM12 is connected to RA16; itsends a measurement report [m1143] that indicates that the quality gradeof SM12->RA16=4 and SM12->RA02=6, so SM12 does not handover to RA02.

RA09 hears only RA16 at quality=6 and SM13 at quality=4. RA16 hears BS08at quality=5, so its current backhauling quality grade is 5. Itbroadcasts it using the broadcast backhauling channel. Now qualitySM12->RA16->Core=9, the backhauling quality grade of RA09=11 andSM13->RA16->Core=9. RA02 hears BS01 at quality=2 so its backhaulingquality=2. RA02 broadcasts that its backhauling quality=2 [m1144], RA16hears that RA02 backhauling quality grade=2, [M1144] directly bylistening to the backhauling broadcast channel or indirectly by gettingmeasurement messages from equipment that is aware of RA02 backhaulingquality. Now, the total quality grade SM12->RA02->core=8 andSM12->RA16->core=9 and therefore RA16 sends a handover required [M1146]message and handover SM12 to RA02. FIG. 14 b schematically describesthis method.

Referring again to FIG. 14, a multi-objective optimizer typicallycomprises a process that simultaneously optimize two or more conflictingobjective subject to a certain constraint. For example maximalthroughput and minimal delay, in the topology depicted in FIG. 8 b. Inorder to obtain maximal throughput from SM07 to the core network anoptimal path may pass through RA09, RA16 and BS08, while the minimumdelay may yield that the optimal path is RA02 and BS01. Amulti-objective optimizer may decide how much of one objective should besacrificed in order to adequately achieve other objectives. One solutionfor the multi-objective problem is to combine all of the objectives intoa single objective function, for example a weighted linear sum of theobjectives:

f(R _(j))=Σ_(i) w _(i) x _(i)

R=minimum,(f(R_(j))); where R is the optimal route.

FIG. 19 a describes an example of a centralistic multi-objective cellrouting planner method, the method including some or all of the stepsillustrated in FIG. 19 a, suitably ordered e.g. as shown. Measurementreports of the UEs (SM/RA) are forwarded to the cell planner method[step 1410]. The method typically goes over all the forwardedmeasurement reports to find if there a significant changes in thetopology [step 1420], for example a drop in the received signalreference quality (RSRQ) in the active link or an increase in the RSRQof another link that is not currently active. If there is a significantchange reported, the planner runs on each link and computes its score[step 1430] for example one or more of link quality, the number ofactive users on a node, hops from the core and weighted aggregation ofseveral criteria. Then the planner finds the optimal path from the nodesto the core, using a multi-objective optimizer [step 1440], for exampleusing the weighted linear metric with the Dijkstra algorithm. The newoptimized computed topology is compared with the old topology [step1450]. If they are different, every node that in the optimal topology islinked to a different serving base station, and the node's currentserving base station is ordered to handover the node to the new optimalserving base station [step 1470].

FIG. 19 b describes an example of a distributed cell routing plannermethod, the method including some or all of the steps illustrated inFIG. 19 b, suitably ordered e.g. as shown. Measurement reports of theUEs (SM/RA) are typically monitored by the local cell planner which mayreside in the RA [step 1415]. The method goes over all receivedmeasurement reports to determine whether or not there are significantchanges in the topology [step 1425], for example a drop in the receivedsignal reference quality (RSRQ) in the active link or an increase in theRSRQ of another link that is not currently active. If there is asignificant change report, the planner runs on each link and computesits score [step 1435] for example one or more of: link quality, thenumber of active users on a node, hops from the core and weightedaggregation of several criteria. Than the planner finds the best servingbase station for each camped node, for example by finding the minimumweight for each served node [step 1445]. If the new serving node of eachcamped device is different than current base station than a hand overmethod is initiated [step 1455].

More generally, the methods and systems shown and described herein asbeing applicable e.g. to certain protocols are also applicable toprotocols which are not identical to the mobile communication protocolsspecifically mentioned herein but have relevant features in commontherewith.

Flowchart illustrations appearing herein are intended to describe stepsof an example method where, alternatively, a method may be substitutedwhich includes only some of the steps illustrated and/or a method inwhich the steps are differently ordered.

It is appreciated that terminology such as “mandatory”, “required”,“need” and “must” refer to implementation choices made within thecontext of a particular implementation or application describedherewithin for clarity and are not intended to be limiting since in analternative implantation, the same elements might be defined as notmandatory and not required, or might even be eliminated altogether.

It is appreciated that software components of the present inventionincluding programs and data may, if desired, be implemented in ROM (readonly memory) form including CD-ROMs, EPROMs and EEPROMs, or may bestored in any other suitable computer-readable medium such as but notlimited to disks of various kinds, cards of various kinds and RAMs.Components described herein as software may, alternatively, beimplemented wholly or partly in hardware, if desired, using conventionaltechniques. Conversely, components described herein as hardware may,alternatively, be implemented wholly or partly in software, if desired,using conventional techniques.

Included in the scope of the present invention, inter alia, areelectromagnetic signals carrying computer-readable instructions forperforming any or all of the steps of any of the methods shown anddescribed herein, in any suitable order; machine-readable instructionsfor performing any or all of the steps of any of the methods shown anddescribed herein, in any suitable order; program storage devicesreadable by machine, tangibly embodying a program of instructionsexecutable by the machine to perform any or all of the steps of any ofthe methods shown and described herein, in any suitable order; acomputer program product comprising a computer useable medium havingcomputer readable program code, such as executable code, having embodiedtherein, and/or including computer readable program code for performing,any or all of the steps of any of the methods shown and describedherein, in any suitable order; any technical effects brought about byany or all of the steps of any of the methods shown and describedherein, when performed in any suitable order; any suitable apparatus ordevice or combination of such, programmed to perform, alone or incombination, any or all of the steps of any of the methods shown anddescribed herein, in any suitable order; electronic devices eachincluding a processor and a cooperating input device and/or outputdevice and operative to perform in software any steps shown anddescribed herein; information storage devices or physical records, suchas disks or hard drives, causing a computer or other device to beconfigured so as to carry out any or all of the steps of any of themethods shown and described herein, in any suitable order; a programpre-stored e.g. in memory or on an information network such as theInternet, before or after being downloaded, which embodies any or all ofthe steps of any of the methods shown and described herein, in anysuitable order, and the method of uploading or downloading such, and asystem including server/s and/or client/s for using such; and hardwarewhich performs any or all of the steps of any of the methods shown anddescribed herein, in any suitable order, either alone or in conjunctionwith software. Any computer-readable or machine-readable media describedherein is intended to include non-transitory computer- ormachine-readable media.

Any computations or other forms of analysis described herein may beperformed by a suitable computerized method. Any step described hereinmay be computer-implemented. The invention shown and described hereinmay include (a) using a computerized method to identify a solution toany of the problems or for any of the objectives described herein, thesolution optionally includes at least one of a decision, an action, aproduct, a service or any other information described herein thatimpacts, in a positive manner, a problem or objectives described herein;and (b) outputting the solution.

Features of the present invention which are described in the context ofseparate embodiments may also be provided in combination in a singleembodiment. Conversely, features of the invention, including methodsteps, which are described for brevity in the context of a singleembodiment or in a certain order may be provided separately or in anysuitable subcombination or in a different order. “e.g.” is used hereinin the sense of a specific example which is not intended to be limiting.Devices, apparatus or systems shown coupled in any of the drawings mayin fact be integrated into a single platform in certain embodiments ormay be coupled via any appropriate wired or wireless coupling such asbut not limited to optical fiber, Ethernet, Wireless LAN, HomePNA, powerline communication, cell phone, PDA, Blackberry GPRS, Satelliteincluding GPS, or other mobile delivery. It is appreciated that in thedescription and drawings shown and described herein, functionalitiesdescribed or illustrated as systems and sub-units thereof can also beprovided as methods and steps therewithin, and functionalities describedor illustrated as methods and steps therewithin can also be provided assystems and sub-units thereof. The scale used to illustrate variouselements in the drawings is merely exemplary and/or appropriate forclarity of presentation and is not intended to be limiting.

1. (canceled)
 2. Relay apparatus including: a relay manager operative toactivate at least one link thereby to cause the relay apparatus tofunction as a node in a hierarchical cellular network; and a set ofradio interfaces operative, when said relay apparatus is disposed at alevel n of a hierarchical cellular network having a core, to provide: acorresponding set of uplinks to said relay apparatus from at least onenode disposed at least one level in said network which is further fromthe core than level n; and a corresponding set of downlinks from saidrelay to said at least one node.
 3. Relay apparatus according to claim 2and also comprising a second set of radio interfaces operative, whensaid relay is disposed at a level n of a hierarchical cellular networkhaving a core, to provide: a corresponding second set of uplinks to saidrelay from at least one node disposed at least one level in said networkwhich is further from the core than level n; and a corresponding secondset of downlinks from said relay to said at least one node.
 4. A datarelay manager providing method including: providing a relay manager,operative to activate at least one link thereby to cause a relay tofunction as a node in a hierarchical cellular network, and a first setof radio interfaces operative, when said relay apparatus is disposed ata level n of a hierarchical cellular network having a core, to provide:a corresponding first set of uplinks from said relay apparatus to atleast one node disposed at least one level in said network which iscloser to the core than level n and a corresponding first set ofdownlinks from said at least one node to said relay.
 5. A methodaccording to claim 4 wherein said set of uplinks and downlinks connectsaid relay to a single node disposed at a level in said network which iscloser to the core than level n.
 6. A method according to claim 4wherein said set of uplinks and downlinks connect said relay to a set ofmore than one nodes disposed at least one level in said network which iscloser to the core than level n. 7-11. (canceled)
 12. A mobilecommunication management system serving a hierarchical cellular networkhaving linked nodes, the nodes including a core, base stations andmobile communication devices, thereby to define a topology ofcommunication links between said nodes, the system comprising: atopology server including: a topology learner which dynamically learnsthe topology and a topology storing functionality which stores thetopology learned by the topology learner as at least one topology mapstructured as a hierarchy having more than 2 levels.
 13. A systemaccording to claim 12 wherein said topology server resides in a singlenode within said network.
 14. (canceled)
 15. A system according to claim12 wherein said topology-storing functionality stores the topology as ahierarchy tree whose number of levels changes dynamically.
 16. A systemaccording to claim 12 wherein said server uses said topology map todynamically route information through at least one downlinks to arriveat a desired destination.
 17. A system according to claim 16 whereinsaid server uses said topology map to dynamically route information byindicating, for each of at least one levels, a sibling-node at saidlevel via which node the information is to arrive at the desireddestination within said map.
 18. A system according to claim 17 whereinthe server broadcasts data packets intended for a destination node notfound at a topological location identified in said map by the server, toat least one base station in the topology map, each of which broadcastto at least one of their “children” nodes in the hierarchal network.19-21. (canceled)
 22. A system according to claim 18 wherein thetopology map defines a set of nodes and wherein the server broadcastsdata packets intended for the not-found destination node only to asubset of said set of nodes which subset is wherein its nodes areadjacent topologically, in said map, to the topological locationidentified by the server as having belonged to the destination node. 23.(canceled)
 24. A system according to claim 17 wherein the serverbroadcasts a paging message intended to locate a destination node notfound at a topological location, identified within said map by theserver, to at least some base stations in the hierarchy, each of whichbroadcasts to at least one of their “children” nodes in the hierarchy.25. (canceled)
 26. A system according to claim 24 wherein said not-founddestination node sends an ‘ack’, upon receipt of the paging message, toits father node in the hierarchy and said ‘ack’ is transmitted (uplink)through the hierarchy to the topology server. 27-30. (canceled)
 31. Asystem according to claim 12 wherein said topology server is distributedover a set of nodes within said network such that least one topologymap, representing at least a portion of the topology of the network,resides within each of said set of nodes.
 32. A system according toclaim 31 wherein at least one node stores a topology map including alist of at least some of its descendants and at least some routinginformation required to get to the descendants. 33-52. (canceled)
 53. Asystem according to claim 18 wherein the server performs a recursiveprocess in which, in a first iteration, the server broadcasts datapackets intended for a destination node not found at a topologicallocation identified in said map by the server, to at least one basestation in the topology map, each of which, in a second iteration,broadcast to at least one of their “children” nodes in the hierarchicalnetwork, and wherein the “children” nodes continue the recursive processfor at least a third iteration, down to a desired level of descendantsof said “children” nodes. 54-58. (canceled)
 59. A system according toclaim 12 wherein topology is determined centralistically based on apotential number of hops. 60-64. (canceled)
 65. A system according toclaim 12 wherein topology is determined at distributed locations overthe topology based on a backhauling link quality score characterizing atleast one inter-node link. 66-70. (canceled)
 71. A system according toclaim 12 and also comprising a local routing manager operative toperform a local process in which information is routed locally from onesibling node to another. 72-110. (canceled)